Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
نویسندگان
چکیده
منابع مشابه
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
We study a method for key predistribution in a network of n users where pairwise keys are computed by hashing users’ IDs along with secret information that has been (pre)distributed to the network users by a trusted entity. A communication graph G can be specified to indicate which pairs of users should be able to compute keys. We determine necessary and sufficient conditions for schemes of thi...
متن کاملLinear Key Predistribution Schemes
In a key predistribution scheme (KPS), some secret information is distributed among a set of users. This secret information must enable every user in some specified privileged groups to compute a common key associated to that group. Besides, this common key must remain unknown to some coalitions of users outside the privileged group. The information rate, that is, the ratio between the length o...
متن کاملKey Predistribution Schemes for Distributed Sensor Networks
Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and t...
متن کاملRandom Key Predistribution Schemes for Sensor Networks
Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys s...
متن کاملRandom Key Predistribution Schemes for Sensor Networks1
Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2015
ISSN: 1862-2976,1862-2984
DOI: 10.1515/jmc-2014-0031